Deterministic Scale-Free Networks
نویسندگان
چکیده
Scale-free networks are abundant in nature, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are stochastic, that is they create networks in which the nodes appear to be randomly connected to each other. Here we propose a simple model that generates scale-free networks in a deterministic fashion. We solve exactly the model, showing that the tail of the degree distribution follows a power law.
منابع مشابه
Coherence in scale-free networks of chaotic maps.
We study fully synchronized states in scale-free networks of chaotic logistic maps as a function of both dynamical and topological parameters. Three different network topologies are considered: (i) a random scale-free topology, (ii) a deterministic pseudofractal scale-free network, and (iii) an Apollonian network. For the random scale-free topology we find a coupling strength threshold beyond w...
متن کاملMultifractality of complex networks.
We demonstrate analytically and numerically the possibility that the fractal property of a scale-free network cannot be characterized by a unique fractal dimension and the network takes a multifractal structure. It is found that the mass exponents τ(q) for several deterministic, stochastic, and real-world fractal scale-free networks are nonlinear functions of q, which implies that structural me...
متن کاملDominating Scale-Free Networks Using Generalized Probabilistic Methods
We study ensemble-based graph-theoretical methods aiming to approximate the size of the minimum dominating set (MDS) in scale-free networks. We analyze both analytical upper bounds of dominating sets and numerical realizations for applications. We propose two novel probabilistic dominating set selection strategies that are applicable to heterogeneous networks. One of them obtains the smallest p...
متن کاملComplex Networks: Deterministic Models
The recent discovery that many networks associated with complex systems belong to a new category known as scale-free small-world has led to a surge in the number of new models for these systems. Many studies are based on probabilistic and statistical methods which capture well some of the basic properties of the networks. More recently, a deterministic approach has proven useful to complement a...
متن کاملScale-free networks are ultrasmall.
We study the diameter, or the mean distance between sites, in a scale-free network, having N sites and degree distribution p(k) proportional, variant k(-lambda), i.e., the probability of having k links outgoing from a site. In contrast to the diameter of regular random networks or small-world networks, which is known to be d approximately ln(N, we show, using analytical arguments, that scale-fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001